Groups of automorphisms of linearly ordered sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphisms of Powers of Linearly Ordered Sets

Let I = ([0; 1];_;^; 0; 1), where _ and ^ are max and min, respectively. This algebra is the basic building block of fuzzy set theory and logic. Likewise, the algebra I = ([0; 1];_;^; 0; 1), where [0; 1] = f(a; b) : a; b 2 [0; 1], a bg, _, ^ are given coordinate-wise, and 0 and 1 are the bounds on [0; 1], is the relevant algebra for interval-valued fuzzy set theory and logic. A good share of th...

متن کامل

Some properties of marginal automorphisms of groups

AbstractLet W be a non-empty subset of a free group. The automorphism of a group G is said to be a marginal automorphism, if for all x in G,x^−1alpha(x) in W^*(G), where W^*(G) is the marginal subgroup of G.In this paper, we give necessary and sufficient condition for a purelynon-abelian p-group G, such that the set of all marginal automorphismsof G forms an elementary abelian p-group.

متن کامل

Pattern classes of permutations via bijections between linearly ordered sets

A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation ...

متن کامل

A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets

In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...

متن کامل

Automorphisms of Free Groups Have Finitely Generated Fixed Point Sets

An automorphism of a finitely generated free group F extends to a homeomorphism of the end completion E of F. The set of fixed points of this homeomorphism is finitely generated in a certain sense. In particular this implies that the subgroup of elements fixed by the automorphism is finitely generated in the usual sense. The emphasis on E instead of F in this paper is analogous to Thurston’s st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1976

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s000497270003673x